Efficient Large-scale Trace Checking Using MapReduce

The problem of checking a logged event trace against a temporal logic specification arises in many practical cases. Unfortunately, known algorithms for an expressive logic like MTL (Metric Temporal Logic) do not scale with respect to two crucial dimensions: the length of the trace and the size of the time interval for which logged events must be buffered to check satisfaction of the specification. The former issue can be addressed by distributed and parallel trace checking algorithms that can take advantage of modern cloud computing and programming frameworks like MapReduce. Still, the latter issue remains open with current state-of-the-art approaches. In this paper we address this memory scalability issue by proposing a new semantics for MTL, called lazy semantics. This semantics can evaluate temporal formulae and boolean combinations of temporal-only formulae at any arbitrary time instant. We prove that lazy semantics is more expressive than standard point-based semantics and that it can be used as a basis for a correct parametric decomposition of any MTL formula into an equivalent one with smaller, bounded time intervals. We use lazy semantics to extend our previous distributed trace checking algorithm for MTL. We evaluate the proposed algorithm in terms of memory scalability and time/memory tradeoffs.Comment: 13 pages, 8 figure

Syntax-driven program verification of matching logic properties

We describe a novel approach to program verification and its application to verification of C programs, where properties are expressed in matching logic. The general approach is syntax-directed: semantic rules, expressed according to Knuths attribute grammars, specify how verification conditions can be computed. Evaluation is performed by interplaying attribute computation and propagation through the syntax tree with invocation of a solver of logic formulae. The benefit of a general syntax-driven approach is that it provides a reusable reference scheme for implementing verifiers for different languages. We show that the instantiation of a general approach to a specific language does not penalize the efficiency of the resulting verifier. This is done by comparing our C verifier for matching logic with an existing tool for the same programming language and logic. A further key advantage of the syntax-directed approach is that it can be the starting point for an incremental verifier -- which is our long-term research target

Trace checking of Metric Temporal Logic with Aggregating Modalities using MapReduce

Modern complex software systems produce a large amount of execution data, often stored in logs. These logs can be analyzed using trace checking techniques to check whether the system complies with its requirements specifications. Often these specifications express quantitative properties of the system, which include timing constraints as well as higher-level constraints on the occurrences of significant events, expressed using aggregate operators. In this paper we present an algorithm that exploits the MapReduce programming model to check specifications expressed in a metric temporal logic with aggregating modalities, over large execution traces. The algorithm exploits the structure of the formula to parallelize the evaluation, with a significant gain in time. We report on the assessment of the implementation - based on the Hadoop framework - of the proposed algorithm and comment on its scalability.Comment: 16 pages, 6 figures, Extended version of the SEFM 2014 pape

PRINS : scalable model inference for component-based system logs

Behavioral software models play a key role in many software engineering tasks; unfortunately, these models either are not available during software development or, if available, quickly become outdated as implementations evolve. Model inference techniques have been proposed as a viable solution to extract finite state models from execution logs. However, existing techniques do not scale well when processing very large logs that can be commonly found in practice. In this paper, we address the scalability problem of inferring the model of a component-based system from large system logs, without requiring any extra information. Our model inference technique, called PRINS, follows a divide-and-conquer approach. The idea is to first infer a model of each system component from the corresponding logs; then, the individual component models are merged together taking into account the flow of events across components, as reflected in the logs. We evaluated PRINS in terms of scalability and accuracy, using nine datasets composed of logs extracted from publicly available benchmarks and a personal computer running desktop business applications. The results show that PRINS can process large logs much faster than a publicly available and well-known state-of-the-art tool, without significantly compromising the accuracy of inferred models

Conceptualizing throughput legitimacy: procedural mechanisms of accountability, transparency, inclusiveness and openness in EU governance

This symposium demonstrates the potential for throughput legitimacy as a concept for shedding empirical light on the strengths and weaknesses of multi-level governance, as well as challenging the concept theoretically. This article introduces the symposium by conceptualizing throughput legitimacy as an ‘umbrella concept’, encompassing a constellation of normative criteria not necessarily empirically interrelated. It argues that in order to interrogate multi-level governance processes in all their complexity, it makes sense for us to develop normative standards that are not naïve about the empirical realities of how power is exercised within multilevel governance, or how it may interact with legitimacy. We argue that while throughput legitimacy has its normative limits, it can be substantively useful for these purposes. While being no replacement for input and output legitimacy, throughput legitimacy offers distinctive normative criteria— accountability, transparency, inclusiveness and openness— and points towards substantive institutional reforms.Published versio

Locating regional health policy: Institutions, politics, and practices

Poverty reduction and health became central in the agendas of Southern regional organisations in the last two decades. Yet, little is known about how these organisations address poverty, inclusion and social inequality, and how Southern regional formations are engaging in power constellations, institutions, processes, interests and ideological positions within different spheres of governance. This article reviews academic literatures spanning global social policy, regional studies and diplomacy studies, and the state of knowledge and understanding of the ‘place’ of regional actors in health governance as a global political practice therein. It identifies theoretical and thematic points of connection between disparate literatures and how these can be bridged through research focusing on the social policies of regional organisations and regional integration processes. This framework hence locates the contributions of each of the research articles of this Special Issue of Global Social Policy on the regional dimension of health policy and diplomacy in relation to Southern Africa and South America. It also highlights the ways in which the articles bring new evidence about how social relations of welfare are being (re)made over larger scales and how regional actors may initiate new norms to improve health rights in international arenas engaging in new forms of ‘regional’ diplomacy

Ideas del alumnado de primaria y secundaria sobre aleatoriedad

En este trabajo comparamos las características de las secuencias de resultados aleatorios y distribuciones aleatorias de puntos generadas por tres grupos de alumnos de Educación Primaria y Secundaria con las propiedades matemáticas de las mismas. La finalidad es describir el significado personal que dichos estudiantes asignan a la aleatoriedad.In this paper we compare the features in random sequences and random distribution of points produced by three groups of students in Primary and Secondary Education with the mathematical properties of the same. The aim is to describe the meaning of randomness for these students.Facultad de Educación y Humanidades - Campus de Melilla (Universidad de Granada)Este trabajo es parte de los proyectos SEJ2004-00789, Madrid, MCYT y FQM-126, Junta de Andalucí